Np-hardness of Some Linear Control Design Problems
نویسندگان
چکیده
We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved by polynomial time algorithms. The problems that we consider include simultaneous stabilization by output feedback, stabilization by state or output feedback in the presence of bounds on the elements of the gain matrix, and decentralized control. These results are obtained by first showing that checking the existence of a stable matrix in an interval family of matrices is NP-hard.
منابع مشابه
NP-hardness of linear multiplicative programming and related problems
The linear multiplicative programming problem minimizes a product of two (positive) variables subject to linear inequality constraints. In this paper, we show NP-hardness of linear multiplicative programming problems and related problems.
متن کاملNew directions on hybrid control systems
Nonlinear control systems have undergone tremendous advances in the last two decades at the levels of theory and applications. Among those, a class of particular interest is that one resulting from the interaction of a control system with a system governed by different dynamics. This class of system lies in the hybrid and nonlinear control systems field. In the last decade, the study of such hy...
متن کاملOn #P-completeness of Some Counting Problems
We prove that the counting problems #1-in-3Sat, #Not-All-Equal 3Sat and #3-Colorability, whose decision counterparts have been the most frequently used in proving NP-hardness of new decision problems, are #P-complete. On one hand, the explicit #P-completeness proof of #1-in-3Sat could be useful to prove complexity results within uniication theory. On the other hand, the fact that #3-Colorabilit...
متن کاملHardness Results and Algebraic Relaxations for Control of Underactuated Robots
In this paper, we study the computational complexity of several important decision problems that arise in robotic control applications and provide algebraic relaxations for designing controllers for such tasks. First, we show that the following decision problems are strongly NP-hard: deciding local asymptotic stability of trigonometric vector fields of degree four, invariance of a ball for poly...
متن کاملOn the NP hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback
In this paper, it is shown that the problem of checking the solvability of a bilinear matrix inequality (BMI), is NP-hard. A matrix valued function, F ( X , Y ) , is called bilinear if it is linear with respect to each of its arguments, and an inequality of the form, F ( X , Y ) > 0 is called a bilinear matrix inequality. Recently, it was shown that, the static output feedback problem, fixed or...
متن کامل